Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents

Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents

We extend a former method for simultaneous search for refutations and models, based on the use of constraints, by extending the expressive power of the constraints. Our extension uses the language of I-terms, in which it is possible to denote innnite sequences of structurally similar terms. Our work generalizes the results of H. Comon Comon, 1995]. Comon gives only a uniication algorithm for \o...

Constraint Solving on Terms :

Dei: A Theorem Prover for Terms with Integer Exponents

An extension of the superposition-based E-prover [8] is described. The extension allows terms with integer exponents [3] in the input language. Obviously, this possibility increases the capabilities of the E-prover particularly for preventing non-termination.

SCIP: solving constraint integer programs

Constraint integer programming (CIP) is a novel paradigm which integrates constraint programming (CP), mixed integer programming (MIP), and satisfiability (SAT) modeling and solving techniques. In this paper we discuss the software framework and solver SCIP (Solving Constraint Integer Programs), which is free for academic and non-commercial use and can be downloaded in source code. This paper g...

On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables

Many mixed-integer constraint satisfaction problems and global optimization problems contain some variables with unbounded domains. Their solution by branch and bound methods to global optimality poses special challenges as the search region is infinitely extended. Many usually strong bounding methods lose their efficiency or fail altogether when infinite domains are involved. Most implemented ...